Evaluation of Stochastic Algorithm Performance on Antenna Benchmark Problems

نویسندگان

  • Irina Brinster
  • Philippe De Wagter
  • Jason Lohn
چکیده

at , with a directivity value of 3.32, and the higher local maximum is located at , with a directivity of 3.26. Another significant local maximum results at ( , 1.09), of directivity 3.10. Thus, this problem represents a typical case of two-dimensional (2-D) unimodal optimization function with a strong local maximum and, moreover, accomplishes all the additional features, mentioned above, that a test problem should have. Therefore, we include it in the numerical test-suite proposed n this paper. It will serve to investigate whether the EAs remains stalled at either strong or weak local maxima instead of reaching the global maximum. The wire dipoles were simulated with NEC using approximately 100 segments per wavelength, with an even number of segments so that the feeding voltage is connected at its corresponding two central segments, and od l s a delta-gap source. The radius of the wires was . The search space was formed with the length of the dipoles varying from to and the observation angle from 0 to radians.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

EVALUATING EFFICIENCY OF BIG-BANG BIG-CRUNCH ALGORITHM IN BENCHMARK ENGINEERING OPTIMIZATION PROBLEMS

Engineering optimization needs easy-to-use and efficient optimization tools that can be employed for practical purposes. In this context, stochastic search techniques have good reputation and wide acceptability as being powerful tools for solving complex engineering optimization problems. However, increased complexity of some metaheuristic algorithms sometimes makes it difficult for engineers t...

متن کامل

A hybrid CS-SA intelligent approach to solve uncertain dynamic facility layout problems considering dependency of demands

This paper aims at proposing a quadratic assignment-based mathematical model to deal with the stochastic dynamic facility layout problem. In this problem, product demands are assumed to be dependent normally distributed random variables with known probability density function and covariance that change from period to period at random. To solve the proposed model, a novel hybrid intelligent algo...

متن کامل

Elite Opposition-based Artificial Bee Colony Algorithm for Global Optimization

 Numerous problems in engineering and science can be converted into optimization problems. Artificial bee colony (ABC) algorithm is a newly developed stochastic optimization algorithm and has been widely used in many areas. However, due to the stochastic characteristics of its solution search equation, the traditional ABC algorithm often suffers from poor exploitation. Aiming at this weakness o...

متن کامل

An Adaptive Approach to Increase Accuracy of Forward Algorithm for Solving Evaluation Problems on Unstable Statistical Data Set

Nowadays, Hidden Markov models are extensively utilized for modeling stochastic processes. These models help researchers establish and implement the desired theoretical foundations using Markov algorithms such as Forward one. however, Using Stability hypothesis and the mean statistic for determining the values of Markov functions on unstable statistical data set has led to a significant reducti...

متن کامل

A novel hybrid meta-heuristic technique applied to the well-known benchmark optimization problems

In this paper, a hybrid meta-heuristic algorithm, based on imperialistic competition algorithm (ICA), harmony search (HS), and simulated annealing (SA) is presented. The body of the proposed hybrid algorithm is based on ICA. The proposed hybrid algorithm inherits the advantages of the process of harmony creation in HS algorithm to improve the exploitation phase of the ICA algorithm. In addition...

متن کامل

Training Radial Basis Function Neural Network using Stochastic Fractal Search Algorithm to Classify Sonar Dataset

Radial Basis Function Neural Networks (RBF NNs) are one of the most applicable NNs in the classification of real targets. Despite the use of recursive methods and gradient descent for training RBF NNs, classification improper accuracy, failing to local minimum and low-convergence speed are defects of this type of network. In order to overcome these defects, heuristic and meta-heuristic algorith...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011